Undirected Capacitated Arc Routing Problems in Debris Collection Operation After Disaster

نویسندگان

  • Andie PRAMUDITA
  • Eiichi TANIGUCHI
  • Ali G. QURESHI
چکیده

1Dept. of Urban Management, Kyoto University (C1-2-334 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected] 2Professor, Dept. of Urban Management, Kyoto University (C1-2-335 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected] 3Lecturer, Dept. of Urban Management, Kyoto University (C1-2-334 Bldg., Kyoto daigaku-Katsura, Nishikyo-ku, Kyoto 615-8530, Japan) E-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities

In this article we present benchmark datasets for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF). The problem is a generalisation of the Capacitated Arc Routing Problem (CARP), and closely represents waste collection routing. Four different test sets are presented, each consisting of multiple instance files, and which can be used to ben...

متن کامل

Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

متن کامل

Flow-based formulations for the Mixed Capacitated Arc Routing Problem – Lower bounds

Mixed Capacitated Arc Routing Problem (MCARP) models arise in distribution or collecting problems where activities are performed by vehicles, with limited capacity, and are continuously distributed along some predefined links (routes, streets) of an associated network. Considering directed as well as undirected required links, it is a generalization of the well known Capacitated Arc Routing pro...

متن کامل

Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application

The urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. Also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). In fact, making slight improvements in this issue lead to a huge saving in municipal consumption. Some inci...

متن کامل

The capacitated arc routing problem with intermediate facilities

The capacitated arc routing problem (CARP) focuses on servicing edges of an undirected network graph. A wide spectrum of applications like mail delivery, waste collection or street maintenance outlines the relevance of this problem. A realistic variant of the CARP arises from the need of intermediate facilities (IFs) to load up or unload the service vehicle and from tour length restrictions. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011